Solving Linear Pseudo-Boolean Constraint Problems with Local Search
نویسنده
چکیده
Stochastic local search is one of the most successful methods for model finding in propositional satisfiability. However, many combinatorial problems have no concise propositional encoding. In this paper, we show that domain-independent local search for satisfiability (Walksat) can be generalized to handle systems of linear pseudo-Boolean (0-1 integer) constraints, a representation that is widely used in operations research. We introduce the algorithm WSAT (PB) and demonstrate its potential in two case studies. The first application is an optimization problem from radar surveillance. Experiments on problems of realistic size show that WSAT (PB) is an efficient heuristic to find good approximate solutions. For most of the test problems, it found provably optimal solutions. In the second case study, we show that pseudoBoolean local search can efficiently solve the progressive party problem, a problem that is hard for constraint programming with chronological backtracking, and whose 0-1 encoding is beyond the size limitations of integer linear pro-
منابع مشابه
Randomised Backtracking for Linear Pseudo-Boolean Constraint Problems
Many constraint satisfaction and optimisation problems can be expressed using linear constraints on pseudo-Boolean (0/1) variables. Problems expressed in this form are usually solved by integer programming techniques, but good results have also been obtained using generalisations of SAT algorithms based on both backtracking and local search. A recent class of algorithm uses randomised backtrack...
متن کاملIncomplete Dynamic Backtracking for Linear Pseudo-Boolean Problems
Many combinatorial problems can be modeled as 0/1 integer linear programs. Problems expressed in this form are usually solved by Operations Research algorithms, but good results have also been obtained using generalised SAT algorithms based on backtracking or local search, after transformation to pseudo-Boolean form. A third class of SAT algorithm uses non-systematic backtracking to combine con...
متن کاملBounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming which combines local search and bounds propagation, inspired by the success of a randomized algorithm for Boolean Satisfiability (SAT) called Unit-Walk. A dynamic prioritization heuristic has been developed to improve the...
متن کاملConstruction of an ROBDD for a PB-Constraint in Band Form and Related Techniques for PB-Solvers
SUMMARY Pseudo-Boolean (PB) problems are Integer Linear Problem restricted to 0-1 variables. This paper discusses on acceleration techniques of PB-solvers that employ SAT-solving of combined CNFs each of which is produced from each PB-constraint via a binary decision diagram (BDD). Specifically, we show (i) an efficient construction of a reduced ordered BDD (ROBDD) from a constraint in band for...
متن کامل